Covering a symmetric poset by symmetric chains
نویسندگان
چکیده
منابع مشابه
Covering symmetric supermodular functions by graphs
The minimum number of edges of an undirected graph covering a symmetric , supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation. 0. INTRODUCTION T. Watanabe and A. Nakamura 1987] proved a min-max formula for the minimum number of new edges whose addition to a given undirected graph...
متن کاملCovering symmetric supermodular functions by uniform hypergraphs
We consider the problem of finding a uniform hypergraph that satisfies cut demands defined by a symmetric crossing supermodular set function. We give min-max formulas for both the degree specified and the minimum cardinality problem. These results include as a special case a formula on the minimum number of r-hyperedges whose addition to an initial hypergraph will make it k-edge-connected.
متن کاملCovering symmetric semi-monotone functions
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0, 1} and we provide a minimax theorem if all the values of the function are different from 1. Our problem is equivalent to the node to area augm...
متن کاملEntangled Markov Chains generated by Symmetric Channels
Abstract: A notion of entangled Markov chain was introduced by Accardi and Fidaleo in the context of quantum random walk. They proved that, in the finite dimensional case, the corresponding states have vanishing entropy density, but they did not prove that they are entangled. In the present note this entropy result is extended to the infinite dimensional case under the assumption of finite spee...
متن کاملThe necklace poset is a symmetric chain order
Let Nn denote the quotient poset of the Boolean lattice, Bn, under the relation equivalence under rotation. Griggs, Killian, and Savage proved that Np is a symmetric chain order for prime p. In this paper, we settle the question of whether this poset is a symmetric chain order for all n by providing an algorithm that produces a symmetric chain decompostion (or SCD). We accomplish this by modify...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1997
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf01215916